Asynchronous computer communication

ABSTRACT

A computer array ( 10 ) has a plurality of computers ( 12 ). The computers ( 12 ) communicate with each other asynchronously, and the computers ( 12 ) themselves operate in a generally asynchronous manner internally. When one computer ( 12 ) attempts to communicate with another it goes to sleep until the other computer ( 12 ) is ready to complete the transaction, thereby saving power and reducing heat production. A plurality of read lines ( 18 ), write lines ( 20 ) and data lines ( 22 ) interconnect the computers ( 12 ). When one computer ( 12 ) sets a read line ( 18 ) high and the other computer sets a corresponding write line ( 20 ) then data is transferred on the data lines ( 22 ). When both the read line ( 18 ) and corresponding write line ( 20 ) go low this allows both communicating computers ( 12 ) to know that the communication is completed. An acknowledge line ( 72 ) goes high to restart the computers ( 12 ).

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to the field of computers and computerprocessors, and more particularly to a method and means for configuringindividual computers and further for connecting the computers togethersuch that the overall speed and, more particularly, the efficiency ofthe combination is optimized. The predominant current usage of thepresent inventive computer array is in the combination of multiplecomputers on a single microchip, wherein both computing power and powerconsumption are important considerations.

2. Description of the Background Art

In the art of computing, processing speed is a much desired quality, andthe quest to create faster computers and processors is ongoing. However,it is generally acknowledged in the industry that the limits forincreasing the speed in microprocessors are rapidly being approached, atleast using presently known technology. Therefore, there is anincreasing interest in the use of multiple processors to increaseoverall computer speed by sharing computer tasks among the processors.But it is also generally acknowledged that there will, almostinevitably, be some decrease in overall efficiency involved in thesharing of the workload. That is, the old adage will apply that justbecause one person can dig a post hole in 60 minutes, it doesnecessarily follow that 60 people could dig a post hole in 1 minute. Thesame principle applies to almost any division of tasks, and the divisionof tasks among processors is no exception.

Of course, efforts are being made to make the sharing of tasks amongcomputer processors more efficient. The question of exactly how thetasks are to be allocated is being examined and processes improved.However, no one expects that there will not be at least some “wasted”processor power in such an arrangement, no matter how clever might bethe implementation.

The lack of a high level of efficiency in multiple processor computersis not necessarily a great hindrance to the overall computingcapabilities of the computer chip or system. Lack of efficiency cangenerally be easily overcome by the sheer brute increase in availableprocessors and processing capacity. However this solution leads toanother problem. That is, so many processors and associated componentscreate an ever increasing amount of heat. Heat is already a problem evenwith today's high power single processor computer chips. They needextraordinary cooling means, such as fans and even water cooling, justto operate normally. Therefore, it has become practically impossible touse the more powerful single processors in small handheld devices, smallapplication specific digital equipment, and the like. The idea ofcombining multiple processors of the type typically in use today on asingle chip would seem to be beyond the physical limits of the packageto dissipate the generated heat, even using the most extraordinary meansof assistance.

The heat problem discussed above is well known in the industry. Greateffort is being made to address the problem. Proposed solutions haveincluded methods for improving efficiency and thereby reducing thenumber and size of processors needed, and methods for reducing the powerconsumption of individual processors. However, it is generallyrecognized that the ultimate solution to this problem has yet to befound. The problem is further compounded by the trend in the industry toapply such processors to small hand held devices. The heat dissipationproblem is difficult enough in larger computer packages, but it seemsalmost insurmountable when the size and inherent lack of heatdissipation surfaces in very small devices is considered. Also, powerconsumption problems go hand in hand with heat production problems.Obviously, wasted heat production means wasted power consumption. Thisis always undesirable, but in small battery powered devices it isunacceptable.

Clearly, it would be advantageous to find a way to provide a greatamount of computing capacity without consuming a great deal of power orcreating a great deal of heat. However, to the inventor's knowledge, nosatisfactory solution has been known prior to the present invention.

SUMMARY

Accordingly, it is an object of the present invention to provide anapparatus and method for increasing computer processing speed.

It is still another object of the present invention to provide anapparatus and method for providing substantial computing powerinexpensively.

It is yet another object of the present invention to provide anapparatus and method for increasing the operational speed of amulti-computer array.

It is still another object of the present invention to provide anapparatus and method for accomplishing computationally intensive tasks.

It is yet another object of the present invention to provide a computerdevice that produces a great amount of processing capability withoutconsuming a great amount of power.

It is still another object of the present invention to provide acomputer device that produces a great amount of processing power withoutcreating a great amount of heat.

Briefly, a known embodiment of the present invention is an array ofcomputers, each computer having its own memory and being capable ofindependent computational functions. In order to accomplish taskscooperatively, the computers must pass data and/or instructions from oneto another. Since all of the computers working simultaneously willtypically provide much more computational power than is required by mosttasks, and since whatever algorithm or method that is used to distributethe task among the several computers will almost certainly result in anuneven distribution of assignments, it is anticipated that at leastsome, and perhaps most, of the computers will not be activelyparticipating in the accomplishment of the task at any given time. Inorder to prevent unnecessary consumption of power and unnecessaryproduction of heat, when a computer attempts to communicate with one ormore of its neighbors it will be in a dormant mode consuming essentiallyno power until the neighbor or one of the neighbors acts to complete thecommunication.

As described herein, the communication between the computers isasynchronous in that it is not timed by any clock, or the like. Rather,it is both begun and completed as the resources become available. Thatis, a computer will either initiate the sending of data or else placeitself in a state ready to receive data when its programming directs itto do so. Then, when the computer, or one of selected computers, withwhich it is attempting to communicate becomes ready to complete thecommunication, it does so.

In order to accomplish the desired savings of power and reduced heatdissipation it is desirable that the initiating computer cease, or atleast significantly reduce, its power consumption while it is awaitingcompletion of the communication. It is conceivable that this could beaccomplished by any of a number of means. For example, if the computerwere timed by either an internal or an external clock, then that clockcould be slowed or stopped during that period of time. However,according to the embodiment of the invention described herein, thecomputers are, themselves, operating asynchronously internally. That is,there is no clock type signal driving the computers (with one exceptiondiscussed herein). It is the natural condition of such an asynchronousdevice to stop in a state wherein essentially no power (except thatconsumed by a small amount of leakage current) is used while thecomputer is awaiting a next operation.

According to the present invention, complete asynchronous operationbetween computers is effected through the use of an acknowledgeoperation. That is, in the prior art, wherein communications areclocked, communications between devices is generally assumed to haveoccurred at a particular time relative to the clocking signal. A sendingcomputer would generally not have any immediate positive feedback toconfirm that its data is received by a receiving computer. However,according to the present invention, when one computer attemptscommunication, either by attempting to send or attempting to receive,and then subsequently another computer completes that operation, eitherby receiving or by sending, the sending computer's action isacknowledged by the receiving computer such that both computers knowthat the transaction is completed. In the present embodiment of theinvention, this acknowledgement is accomplished by bringing controllines low such that data cycles, or time, is not wasted in accomplishingthe acknowledge operation. However, the inventor believes that theoperation of acknowledging the completion of a communication isapplicable to essentially any asynchronous communication betweendevices, whether those devices be inherently internally asynchronous ornot, and further even whether they might be based on conventionalelectronic circuitry, molecular principles, or any other principle ofoperation now in existence or to be developed in the future.

These and other objects and advantages of the present invention willbecome clear to those skilled in the art in view of the description ofmodes of carrying out the invention, and the industrial applicabilitythereof, as described herein and as illustrated in the several figuresof the drawing. The objects and advantages listed are not an exhaustivelist of all possible advantages of the invention. Moreover, it will bepossible to practice the invention even where one or more of theintended objects and/or advantages might be absent or not required inthe application.

Further, those skilled in the art will recognize that variousembodiments of the present invention may achieve one or more, but notnecessarily all, of the described objects and/or advantages.Accordingly, the objects and/or advantages described herein are notessential elements of the present invention, and should not be construedas limitations.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagrammatic view of a computer array, according to oneembodiment of the present invention;

FIG. 2 is a detailed diagram showing a subset of the computers of FIG. 1and a more detailed view of the interconnecting data buses of FIG. 1;

FIG. 3 is a block diagram depicting a general layout of one of thecomputers of FIGS. 1 and 2;

FIG. 4 is a diagrammatic representation of an instruction word accordingto the present inventive application;

FIG. 5 is a schematic representation of the slot sequencer 42 of FIG. 3;and

FIG. 6 is a flow diagram depicting an example of the present inventivemethod.

DETAILED DESCRIPTION OF THE INVENTION

This invention is described in the following description with referenceto the Figures, in which like numbers represent the same or similarelements. While this invention is described in terms of modes forachieving this invention's objectives, it will be appreciated by thoseskilled in the art that variations may be accomplished in view of theseteachings without deviating from the spirit or scope of the presentinvention.

The embodiments and variations of the invention described herein, and/orshown in the drawings, are presented by way of example only and are notlimiting as to the scope of the invention. Unless otherwise specificallystated, individual aspects and components of the invention may beomitted or modified, or may have substituted therefore knownequivalents, or as yet unknown substitutes such as may be developed inthe future or such as may be found to be acceptable substitutes in thefuture. The invention may also be modified for a variety of applicationswhile remaining within the spirit and scope of the claimed invention,since the range of potential applications is great, and since it isintended that the present invention be adaptable to many suchvariations.

A known mode for carrying out the invention is an array of individualcomputers. The inventive computer array is depicted in a diagrammaticview in FIG. 1 and is designated therein by the general referencecharacter 10. The computer array 10 has a plurality (twenty-four in theexample shown) of computers 12 (sometimes also referred to as “cores” or“nodes” in the example of an array). In the example shown, all of thecomputers 12 are located on a single die 14. According to the presentinvention, each of the computers 12 is a generally independentlyfunctioning computer, as will be discussed in more detail hereinafter.The computers 12 are interconnected by a plurality (the quantities ofwhich will be discussed in more detail hereinafter) of interconnectingdata buses 16. In this example, the data buses 16 are bidirectionalasynchronous high speed parallel data buses, although it is within thescope of the invention that other interconnecting means might beemployed for the purpose. In the present embodiment of the array 10, notonly is data communication between the computers 12 asynchronous, theindividual computers 12 also operate in an internally asynchronous mode.This has been found by the inventor to provide important advantages. Forexample, since a clock signal does not have to be distributed throughoutthe computer array 10, a great deal of power is saved. Furthermore, nothaving to distribute a clock signal eliminates many timing problems thatcould limit the size of the array 10 or cause other known difficulties.

One skilled in the art will recognize that there will be additionalcomponents on the die 14 that are omitted from the view of FIG. 1 forthe sake of clarity. Such additional components include power buses,external connection pads, and other such common aspects of amicroprocessor chip.

Computer 12 e is an example of one of the computers 12 that is not onthe periphery of the array 10. That is, computer 12 e has fourorthogonally adjacent computers 12 a, 12 b, 12 c and 12 d. This groupingof computers 12 a through 12 e will be used hereinafter in relation to amore detailed discussion of the communications between the computers 12of the array 10. As can be seen in the view of FIG. 1, interiorcomputers such as computer 12 e will have four other computers 12 withwhich they can directly communicate via the buses 16. In the followingdiscussion, the principles discussed will apply to all of the computers12 except that the computers 12 on the periphery of the array 10 will bein direct communication with only three or, in the case of the cornercomputers 12, only two other of the computers 12.

FIG. 2 is a more detailed view of a portion of FIG. 1 showing only someof the computers 12 and, in particular, computers 12 a through 12 e,inclusive. The view of FIG. 2 also reveals that the data buses 16 eachhave a read line 18, a write line 20 and a plurality (eighteen, in thisexample) of data lines 22. The data lines 22 are capable of transferringall the bits of one eighteen-bit instruction word generallysimultaneously in parallel. It should be noted that, in one embodimentof the invention, some of the computers 12 are mirror images of adjacentcomputers. However, whether the computers 12 are all orientedidentically or as mirror images of adjacent computers is not an aspectof this presently described invention. Therefore, in order to betterdescribe this invention, this potential complication will not bediscussed further herein.

According to the present inventive method, a computer 12, such as thecomputer 12 e can set one, two, three or all four of its read lines 18such that it is prepared to receive data from the respective one, two,three or all four adjacent computers 12. Similarly, it is also possiblefor a computer 12 to set one, two, three or all four of its write lines20 high. Although the inventor does not believe that there is presentlyany practical value to setting more than one of a computer's 12 writelines 20 high at one time, doing so is not beyond the scope of thisinvention, as it conceivable that a use for such an operation may occur.

When one of the adjacent computers 12 a, 12 b, 12 c or 12 d sets a writeline 20 between itself and the computer 12 e high, if the computer 12 ehas already set the corresponding read line 18 high, then a word istransferred from that computer 12 a, 12 b, 12 c or 12 d to the computer12 e on the associated data lines 22. Then the sending computer 12 willrelease the write line 20 and the receiving computer (12 e in thisexample) pulls both the write line 20 and the read line 18 low. Thelatter action will acknowledge to the sending computer 12 that the datahas been received. Note that the above description is not intendednecessarily to denote the sequence of events in order. In actualpractice, in this example the receiving computer may try to set thewrite line 20 low slightly before the sending computer 12 releases(stops pulling high) its write line 20. In such an instance, as soon asthe sending computer 12 releases its write line 20 the write line 20will be pulled low by the receiving computer 12 e.

In the present example, only a programming error would cause bothcomputers 12 on the opposite ends of one of the buses 16 to try to sethigh the read line 18 there-between. Also, it would be error for bothcomputers 12 on the opposite ends of one of the buses 16 to try to sethigh the write line 18 there-between at the same time. Similarly, asdiscussed above, it is not currently anticipated that it would bedesirable to have a single computer 12 set more than one of its fourwrite lines 20 high. However, it is presently anticipated that therewill be occasions wherein it is desirable to set different combinationsof the read lines 18 high such that one of the computers 12 can be in await state awaiting data from the first one of the chosen computers 12to set its corresponding write line 20 high.

In the example discussed above, computer 12 e was described as settingone or more of its read lines 18 high before an adjacent computer(selected from one or more of the computers 12 a, 12 b, 12 c or 12 d)has set its write line 20 high. However, this process can certainlyoccur in the opposite order. For example, if the computer 12 e wereattempting to write to the computer 12 a, then computer 12 e would setthe write line 20 between computer 12 e and computer 12 a to high. Ifthe read line 18 between computer 12 e and computer 12 a has then notalready been set to high by computer 12 a, then computer 12 e willsimply wait until computer 12 a does set that read line 20 high. Then,as discussed above, when both of a corresponding pair of write line 18and read line 20 are high the data awaiting to be transferred on thedata lines 22 is transferred. Thereafter, the receiving computer 12(computer 12 a, in this example) sets both the read line 18 and thewrite line 20 between the two computers (12 e and 12 a in this example)to low as soon as the sending computer 12 e releases it.

Whenever a computer 12 such as the computer 12 e has set one of itswrite lines 20 high in anticipation of writing it will simply wait,using essentially no power, until the data is “requested”, as describedabove, from the appropriate adjacent computer 12, unless the computer 12to which the data is to be sent has already set its read line 18 high,in which case the data is transmitted immediately. Similarly, whenever acomputer 12 has set one or more of its read lines 18 to high inanticipation of reading it will simply wait, using essentially no power,until the write line 20 connected to a selected computer 12 goes high totransfer an instruction word between the two computers 12.

There may be several potential means and/or methods to cause thecomputers 12 to function as described above. However, in this presentexample, the computers 12 so behave simply because they are operatinggenerally asynchronously internally (in addition to transferring datathere-between in the asynchronous manner described). That is,instructions are completed sequentially. When either a write or readinstruction occurs, there can be no further action until thatinstruction is completed (or, perhaps alternatively, until it isaborted, as by a “reset” or the like). There is no regular clock pulse,in the prior art sense. Rather, a pulse is generated to accomplish anext instruction only when the instruction being executed either is nota read or write type instruction (given that a read or write typeinstruction would require completion by another entity) or else when theread or write type operation is, in fact, completed.

FIG. 3 is a block diagram depicting the general layout of an example ofone of the computers 12 of FIGS. 1 and 2. As can be seen in the view ofFIG. 3, each of the computers 12 is a generally self contained computerhaving its own RAM 24 and ROM 26. As mentioned previously, the computers12 are also sometimes referred to as individual “cores”, given that theyare, in the present example, combined on a single chip.

Other basic components of the computer 12 are a return stack 28, aninstruction area 30, an arithmetic logic unit (“ALU”) 32, a data stack34 and a decode logic section 36 for decoding instructions. One skilledin the art will be generally familiar with the operation of stack basedcomputers such as the computers 12 of this present example. Thecomputers 12 are dual stack computers having the data stack 34 andseparate return stack 28.

In this embodiment of the invention, the computer 12 has fourcommunication ports 38 for communicating with adjacent computers 12. Thecommunication ports 38 are tri-state drivers, having an off status, areceive status (for driving signals into the computer 12) and a sendstatus (for driving signals out of the computer 12). Of course, if theparticular computer 12 is not on the interior of the array (FIG. 1) suchas the example of computer 12 e, then one or more of the communicationports will not be used in that particular computer, at least for thepurposes described herein. The instruction area 30 includes a number ofregisters 40 including, in this example, an A register 40 a, a Bregister 40 b and a P register 40 c. In this example, the A register 40a is a full eighteen-bit register, while the B register 40 b and the Pregister 40 c are nine-bit registers.

Although the invention is not limited by this example, the presentcomputer 12 is implemented to execute native Forth languageinstructions. As one familiar with the Forth computer language willappreciate, complicated Forth instructions, known as Forth “words” areconstructed from the native processor instructions designed into thecomputer. The collection of Forth words is known as a “dictionary”. Inother languages, this might be known as a “library”. As will bedescribed in greater detail hereinafter, the computer 12 reads eighteenbits at a time from RAM 24, ROM 26 or directly from one of the databuses 16 (FIG. 2). However, since in Forth most instructions (known asoperand-less instructions) obtain their operands directly from thestacks 28 and 34, they are generally only five bits in length such thatup to four instructions can be included in a single eighteen-bitinstruction word, with the condition that the last instruction in thegroup is selected from a limited set of instructions that require onlythree bits. Also depicted in block diagrammatic form in the view of FIG.3 is a slot sequencer 42. In this embodiment of the invention, the toptwo registers in the data stack 34 are a T register 44 and an S register46.

FIG. 4 is a diagrammatic representation of an instruction word 48. (Itshould be noted that the instruction word 48 can actually containinstructions, data, or some combination thereof.) The instruction word48 consists of eighteen bits 50. This being a binary computer, each ofthe bits 50 will be a ‘1’ or a ‘0’. As previously discussed herein, theeighteen-bit wide instruction word 48 can contain up to fourinstructions 52 in four slots 54 called slot zero 54 a, slot one 54 b,slot two 54 c and slot three 54 d. In the present embodiment of theinvention, the eighteen-bit instruction words 48 are always read as awhole. Therefore, since there is always a potential of having up to fourinstructions in the instruction word 48, a no-op (no operation)instruction is included in the instruction set of the computer 12 toprovide for instances when using all of the available slots 54 might beunnecessary or even undesirable. It should be noted that, according toone particular embodiment of the invention, the polarity (active high ascompared to active low) of bits 50 in alternate slots (specifically,slots one 54 b and three 54 c) is reversed. However, this is not anecessary aspect of the presently described invention and, therefore, inorder to better explain this invention this potential complication isavoided in the following discussion.

FIG. 5 is a schematic representation of the slot sequencer 42 of FIG. 3.As can be seen in the view of FIG. 5, the slot sequencer 42 has aplurality (fourteen in this example) of inverters 56 and one NAND gate58 arranged in a ring, such that a signal is inverted an odd number oftimes as it travels through the fourteen inverters 56 and the NAND gate58. A signal is initiated in the slot sequencer 42 when either of thetwo inputs to an OR gate 60 goes high. A first OR gate input 62 isderived from a bit i4 66 (FIG. 4) of the instruction 52 being executed.If bit i4 is high then that particular instruction 52 is an ALUinstruction, and the i4 bit 66 is ‘1’. When the i4 bit is ‘1’, then thefirst OR gate input 62 is high, and the slot sequencer 42 is triggeredto initiate a pulse that will cause the execution of the nextinstruction 52.

When the slot sequencer 42 is triggered, either by the first OR gateinput 62 going high or by the second OR gate input 64 going high (aswill be discussed hereinafter), then a signal will travel around theslot sequencer 42 twice, producing an output at a slot sequencer output68 each time. The first time the signal passes the slot sequencer output68 it will be low, and the second time the output at the slot sequenceroutput 68 will be high. The relatively wide output from the slotsequencer output 68 is provided to a pulse generator 70 (shown in blockdiagrammatic form) that produces a narrow timing pulse as an output. Oneskilled in the art will recognize that the narrow timing pulse isdesirable to accurately initiate the operations of the computer 12.

When the particular instruction 52 being executed is a read or a writeinstruction, or any other instruction wherein it is not desired that theinstruction 52 being executed triggers immediate execution of the nextinstruction 52 in sequence, then the i4 bit 66 is ‘0’ (low) and thefirst OR gate input 62 is, therefore, also low. One skilled in the artwill recognize that the timing of events in a device such as thecomputers 12 is generally quite critical, and this is no exception. Uponexamination of the slot sequencer 42 one skilled in the art willrecognize that the output from the OR gate 60 must remain high untilafter the signal has circulated past the NAND gate 58 in order toinitiate the second “lap” of the ring. Thereafter, the output from theOR gate 60 will go low during that second “lap” in order to preventunwanted continued oscillation of the circuit.

As can be appreciated in light of the above discussion, when the i4 bit66 is ‘0’, then the slot sequencer 42 will not be triggered—assumingthat the second OR gate input 66, which will be discussed hereinafter,is not high.

As discussed, above, the i4 bit 66 of each instruction 52 is setaccording to whether or not that instruction is a read or write type ofinstruction. The remaining bits 50 in the instruction 52 provide theremainder of the particular opcode for that instruction. In the case ofa read or write type instruction, one or more of the bits may be used toindicate where data is to be read from or written to in that particularcomputer 12. In the present example of the invention, data to be writtenalways comes from the T register 44 (the top of the data stack 34),however data can be selectively read into either the T register 44 orelse the instruction area 30 from where it can be executed. That isbecause, in this particular embodiment of the invention, either data orinstructions can be communicated in the manner described herein andinstructions can, therefore, be executed directly from the data bus 16,although this is not a necessary aspect of this present invention.Furthermore, one or more of the bits 50 will be used to indicate whichof the ports 38, if any, is to be set to read or write. This lateroperation is optionally accomplished by using one or more bits todesignate a register 40, such as the A register 40 a, the B register, orthe like. In such an example, the designated register 40 will bepreloaded with data having a bit corresponding to each of the ports 38(and, also, any other potential entity with which the computer 12 may beattempting to communicate, such as memory, an external communicationsport, or the like.) For example, each of four bits in the particularregister 40 can correspond to each of the up port 38 a, the right port38 b, the left port 38 c or the down port 38 d. In such case, wherethere is a ‘1’ at any of those bit locations, communication will be setto proceed through the corresponding port 38. As previously discussedherein, in the present embodiment of the invention it is anticipatedthat a read opcode might set more than one port 38 for communication ina single instruction while, although it is possible, it is notanticipated that a write opcode will set more than one port 38 forcommunication in a single instruction.

The immediately following example will assume a communication whereincomputer 12 e is attempting to write to computer 12 c, although theexample is applicable to communication between any adjacent computers12. When a write instruction is executed in a writing computer 12 e, theselected write line 20 (in this example, the write line 20 betweencomputers 12 e and 12 c) is set high. If the corresponding read line 18is already high, then data is immediately sent from the selectedlocation through the selected communications port 38. Alternatively, ifthe corresponding read line 18 is not already high, then computer 12 ewill simply stop operation until the corresponding read line 18 does gohigh. The mechanism for stopping (or, more accurately, not enablingfurther operations of) the computer 12 a when there is a read or writetype instruction has been discussed previously herein. In short, theopcode of the instruction 52 will have a ‘0’ at bit position i4 66, andso the first OR gate input 62 of the OR gate 60 is low, and so the slotsequencer 42 is not triggered to generate an enabling pulse.

As for how the operation of the computer 12 e is resumed when a read orwrite type instruction is completed, the mechanism for that is asfollows: When both the read line 18 and the corresponding write line 20between computers 12 e and 12 c are high, then both lines 18 and 20 willbe released by each of the respective computers 12 that is holding ithigh. (In this example, the sending computer 12 e will be holding thewrite line 18 high while the receiving computer 12 c will be holding theread line 20 high). Then the receiving computer 12 c will pull bothlines 18 and 20 low. In actual practice, the receiving computer 12 c mayattempt to pull the lines 18 and 20 low before the sending computer 12 ehas released the write line 18. However, since the lines 18 and 20 arepulled high and only weakly held (latched) low, any attempt to pull aline 18 or 20 low will not actually succeed until that line 18 or 20 isreleased by the computer 12 that is latching it high.

When both lines 18 and 20 in a data bus 16 are pulled low, this is an“acknowledge” condition. Each of the computers 12 e and 12 c will, uponthe acknowledge condition, set its own internal acknowledge line 72high. As can be seen in the view of FIG. 5, the acknowledge line 72provides the second OR gate input 64. Since an input to either of the ORgate 60 inputs 62 or 64 will cause the output of the OR gate 60 to gohigh, this will initiate operation of the slot sequencer 42 in themanner previously described herein, such that the instruction 52 in thenext slot 54 of the instruction word 48 will be executed. Theacknowledge line 72 stays high until the next instruction 52 is decoded,in order to prevent spurious addresses from reaching the address bus.

In any case when the instruction 52 being executed is in the slot threeposition of the instruction word 48, the computer 12 will fetch the nextawaiting eighteen-bit instruction word 48 unless, of course, bit i4 66is a ‘0’. In actual practice, the present inventive mechanism includes amethod and apparatus for “prefetching” instructions such that the fetchcan begin before the end of the execution of all instructions 52 in theinstruction word 48. However, this also is not a necessary aspect of thepresent inventive method and apparatus for asynchronous datacommunications.

The above example wherein computer 12 e is writing to computer 12 c hasbeen described in detail. As can be appreciated in light of the abovediscussion, the operations are essentially the same whether computer 12e attempts to write to computer 12 c first, or whether computer 12 cfirst attempts to read from computer 12 e. The operation cannot becompleted until both computers 12 and 12 c are ready and, whichevercomputer 12 e or 12 c is ready first, that first computer 12 simply“goes to sleep” until the other computer 12 e or 12 c completes thetransfer. Another way of looking at the above described process is that,actually, both the writing computer 12 e and the receiving computer 12 cgo to sleep when they execute the write and read instructions,respectively, but the last one to enter into the transaction reawakensnearly instantaneously when both the read line 18 and the write line 20are high, whereas the first computer 12 to initiate the transaction canstay asleep nearly indefinitely until the second computer 12 is ready tocomplete the process.

The inventor believes that a key feature for enabling efficientasynchronous communications between devices is some sort of acknowledgesignal or condition. In the prior art, most communication betweendevices has been clocked and there is no direct way for a sending deviceto know that the receiving device has properly received the data.Methods such as checksum operations may have been used to attempt toinsure that data is correctly received, but the sending device has nodirect indication that the operation is completed. The present inventivemethod, as described herein, provides the necessary acknowledgecondition that allows, or at least makes practical, asynchronouscommunications between the devices. Furthermore, the acknowledgecondition also makes it possible for one or more of the devices to “goto sleep” until the acknowledge condition occurs. Of course, anacknowledge condition could be communicated between the computers 12 bya separate signal being sent between the computers 12 (either over theinterconnecting data bus 16 or over a separate signal line), and such anacknowledge signal would be within the scope of this aspect of thepresent invention. However, according to the embodiment of the inventiondescribed herein, it can be appreciated that there is even more economyinvolved here, in that the method for acknowledgement does not requireany additional signal, clock cycle, timing pulse, or any such resourcebeyond that described, to actually affect the communication.

In light of the above discussion of the procedures and means foraccomplishing them, the following brief description of an example of theinventive method can now be understood. FIG. 6 is a flow diagram,designated by the reference character 74, depicting this method example.In an ‘initiate communication’ operation 76 one computer 12 executes aninstruction 53 that causes it to attempt to communicate with anothercomputer 12. This can be either an attempt to write or an attempt toread. In a ‘set first line high’ operation 78, which occurs generallysimultaneously with the ‘initiate communication’ operation 76, either aread line 18 or a write line 20 is set high (depending upon whether thefirst computer 12 is attempting to read or to write). As a part of the‘set first line high’ operation, the computer 12 doing so will,according the presently described embodiment of the operation, ceaseoperation, as described in detail previously herein. In a ‘set secondline high’ operation 80 the second line (either the write line 20 orread line 18) is set high by the second computer 12. In a ‘communicatedata operation’ data (or instructions, or the like) is transmitted andreceived over the data lines 22. In a ‘pull lines low’ operation 84, theread line 18 and the write line 20 are released and then pulled low. Ina ‘continue’ operation 86 the acknowledge condition causes the computers12 to resume their operation. In the case of the present inventiveexample, the acknowledge condition causes an acknowledge signal 86 (FIG.5) which, in this case, is simply the “high” condition of theacknowledge line 72.

Various modifications may be made to the invention without altering itsvalue or scope. For example, while this invention has been describedherein in terms of read instructions and write instructions, in actualpractice there may be more than one read type instruction and/or morethan one write type instruction. As just one example, in one embodimentof the invention there is a write instruction that increments theregister and other write instructions that do not. Similarly, writeinstructions can vary according to which register 40 is used to selectcommunications ports 38, or the like, as discussed previously herein.There can also be a number of different read instructions, dependingonly upon which variations the designer of the computers 12 deems to bea useful choice of alternative read behaviors.

Similarly, while the present invention has been described herein inrelation to communications between computers 12 in an array 10 on asingle die 14, the same principles and method can be used, or modifiedfor use, to accomplish other inter-device communications, such ascommunications between a computer 12 and its dedicated memory or betweena computer 12 in an array 10 and an external device (through aninput/output port, or the like). Indeed, it is anticipated that someapplications may require arrays of arrays—with the presently describedinter device communication method being potentially applied tocommunication among the arrays of arrays.

While specific examples of the inventive computer array 10 and computer12 have been discussed therein, it is expected that there will be agreat many applications for these which have not yet been envisioned.Indeed, it is one of the advantages of the present invention that theinventive method and apparatus may be adapted to a great variety ofuses.

All of the above are only some of the examples of available embodimentsof the present invention. Those skilled in the art will readily observethat numerous other modifications and alterations may be made withoutdeparting from the spirit and scope of the invention. Accordingly, thedisclosure herein is not intended as limiting and the appended claimsare to be interpreted as encompassing the entire scope of the invention.

INDUSTRIAL APPLICABILITY

The inventive computer array 10, computers 12 and associated method 74are intended to be widely used in a great variety of computerapplications. It is expected that it they will be particularly useful inapplications where significant computing power is required, and yetpower consumption and heat production are important considerations.

As discussed previously herein, the applicability of the presentinvention is such that many types of inter-device computercommunications can be improved thereby. It is anticipated that theinventive method, wherein some computers can be allowed to “go to sleep”when not in use, will be used to reduce power consumption, reduce heatproduction, and improve the efficiency of communication betweencomputers and computerized devices in a great variety of applicationsand implementations.

Since the computer array 10, computer 12 and method 74 of the presentinvention may be readily produced and integrated with existing tasks,input/output devices, and the like, and since the advantages asdescribed herein are provided, it is expected that they will be readilyaccepted in the industry. For these and other reasons, it is expectedthat the utility and industrial applicability of the invention will beboth significant in scope and long-lasting in duration.

CORRESPONDENCE CHART

-   10 computer array-   12 computers-   14 die-   16 data bus-   18 read line-   20 write line-   22 data lines-   24 RAM-   26 ROM-   28 return stack-   30 instruction area-   32 ALU-   34 data stack-   36 decode section-   38 internal communications port-   38 a up port-   38 b right port-   38 c left port-   38 d down port-   40 registers-   40 a A register-   40 b B register-   40 c P register-   42 slot sequencer-   44 T register-   46 S register-   48 instruction word-   50 bits-   52 instructions-   54 slots-   54 a slot 0-   54 b slot 1-   54 c slot 2-   54 d slot 3-   56 inverters-   58 NAND gate-   60 OR gate-   62 first OR gate input-   64 second OR gate input-   66 i4 bit-   68 slot sequencer output-   70 pulse generator-   72 acknowledge line-   74 method-   76 initiate communication operation-   78 set first line high operation-   80 set second line high operation-   82 communicate data-   84 continue-   86 acknowledge signal

1. A computer array, comprising: a plurality of computers; and aplurality of data paths connecting the computers; and wherein when afirst one of said computers attempts a communication with a second oneof said computers then said first one of said computers stops operationuntil said second one of said computers is ready to complete thecommunication.
 2. The computer array of claim 1, wherein: said first oneof said computers is attempting to write; and said second one of saidcomputers completes the communication by reading from said second one ofsaid computers.
 3. The computer array of claim 1, wherein: said firstone of said computers is attempting to read; and said second one of saidcomputers completes the communication by writing to said first one ofsaid computers.
 4. The computer array of claim 3, wherein: said firstone of said computers is configured to read from more than one othercomputer.
 5. The computer array of claim 1, wherein: when the first oneof said computers attempts a communication with second of said computersthen said first computer sets a write line high; and when the second oneof said computers is ready to complete the communication it sets a readline high.
 6. The computer array of claim 5, wherein: when the read linehigh is and further when the corresponding write line is also high thendata is transferred between the first one of said computers and thesecond one of said computers.
 7. The computer array of claim 6, wherein:when data is transferred between the first one of said computers and thesecond one of said computers, then the read line and the write line bothgo low.
 8. The computer array of claim 7, wherein: when the read lineand the write line both go low, then both the first one of saidcomputers and the second one of said computers resume operation.
 9. Amethod for communicating between a first computer device and a secondcomputer device, comprising: causing the first computer device toindicate its readiness to communicate with the second computer device;causing the second computer device to indicate its readiness to completethe communication; transferring data between the first computer deviceand the second computer device; and causing the second computer deviceto acknowledge to the first computer device that the communication iscompleted.
 10. The method of claim 9, wherein: the first computer deviceindicates its readiness to write to the second computer.
 11. The methodof claim 10, wherein: the first computer device indicates its readinessto write to the second computer by setting a write line there-between tohigh.
 12. The method of claim 9, wherein: the first computer deviceindicates its readiness to read from the second computer.
 13. The methodof claim 12, wherein: the first computer device indicates its readinessto read from the second computer by setting a read line there-between tohigh.
 14. The method of claim 9, wherein: the first computer deviceindicates its readiness to communicate with the second computer deviceby setting one of a read line or a write line to high; the secondcomputer device indicates its readiness to communicate with the firstcomputer device by setting the other of the read line or the write lineto high; and when both the read line and the write line are high thendata is transferred between the first computer device and the secondcomputer device.
 15. The method of claim 9, wherein: the second computerdevice acknowledges that the communication is completed by pulling boththe read line and the write line to low.
 16. The method of claim 15,wherein: in order to allow both the read line and the write line to bepulled to low, the first computer device releases one of a read line ora write line; and the second computer device releases the other of theread line or the write line.
 17. A method for communicating betweencomputers, comprising: (a) causing a first computer to indicate itsreadiness to communicate; (b) causing said first computer to then ceaseoperation; (c) causing a second computer to indicate its readiness tocommunicate to said first computer; (d) transferring data between saidfirst computer and said second computer; and (e) causing said firstcomputer to resume operation.
 18. The method of claim 17, wherein: saidfirst computer is caused to resume operation when said second computeracknowledges that the communication is accomplished.
 19. The method ofclaim 17, wherein: said first computer sets a write line between saidfirst computer and said second computer; said second computer sets aread line between said first computer and said second computer; and saidfirst computer is caused to resume operation after both the read lineand the write line are set.
 20. The method of claim 19, wherein: whenboth the read line and the write line are set then data is transferredbetween the first computer and the second computer.
 21. The method ofclaim 19, wherein: when both the read line and the write line are set,then both the read line and the write line are unset to indicate thatdata has been transferred.
 22. The method of claim 21, wherein: saidfirst computer sets the write line by causing the write line to go high;said second computer sets the read line by causing the read line to gohigh; and said read line and said write line are unset by causing theread line and the write line to go low.
 23. The method of claim 17,wherein: the order of operation steps (a) and (b) is reversed ascompared to the order presented in claim
 17. 24. A computer, comprising:at least one data transmission means for communicating between a firstcomputer and a second computer; means for causing said first computer toindicate that it is ready to communicate; means for causing said secondcomputer to indicate that it is ready to communicate; means foracknowledging that a communication has been accomplished.
 25. Thecomputer of claim 24, and further including means for stopping saidfirst computer until said means for acknowledging that a communicationhas been accomplished has so indicated.